Distributed Computation for Swapping a Failing Edge
نویسندگان
چکیده
We consider the problem of computing the best swap edges of a shortest-path tree Tr rooted in r. That is, given a single link failure: if the path is not affected by the failed link, then the message will be delivered through that path; otherwise, we want to guarantee that, when the message reaches the edge (u, v) where the failure has occurred, the message will then be re-routed using the computed swap edge. There exist highly efficient serial solutions for the problem, but unfortunately because of the structures they use, there is no known (nor foreseeable) efficient distributed implementation for them. A distributed protocol exists only for finding swap edges, not necessarily optimal ones. In [6], distributed solutions to compute the swap edge that minimizes the distance from u to r have been presented. In contrast, in this paper we focus on selecting, efficiently and distributively, the best swap edge according to an objective function suggested in [13]: we choose the swap edge that minimizes the distance from u to v.
منابع مشابه
PAIRED ANISOTROPIC DISTRIBUTION FOR IMAGE SELECTIVE SMOOTHING
In this paper, we present a novel approach for image selective smoothing by the evolution of two paired nonlinear partial differential equations. The distribution coefficient in de-noising equation controls the speed of distribution, and is determined by the edge-strength function. In the previous works, the edge-strength function depends on isotropic smoothing of the image...
متن کاملSwapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor
We consider a two-edge connected, undirected graph G = (V, E), with n nodes and m non-negatively real weighted edges, and a single source shortest paths tree (SPT) T of G rooted at an arbitrary node r . If an edge in T is temporarily removed, it makes sense to reconnect the nodes disconnected from the root by adding a single non-tree edge, called a swap edge, instead of rebuilding a new optimal...
متن کاملHow to Swap a Failing Edge of a Single Source Shortest Paths Tree
In this paper we introduce the notion of best swap for a failing edge of a single source shortest paths tree (SPT) S(r) rooted in r in a weighted graph G = (V, E). Given an edge e ∈ S(r), an edge e′ ∈ E \{e} is a swap edge if the swap tree Se/e′(r) obtained by swapping e with e′ in S(r) is a spanning tree of G. A best swap edge for a given edge e is a swap edge minimizing some distance function...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملEvolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communications. This is especially beneficial to the class of synchronous dataflow computations which are generally compiled once and run many times over different data sets. Unlike genetic approaches which generally use task swappin...
متن کامل